Multipartite Moore digraphs

Title: Multipartite Moore digraphs
Creator: Fiol, M. A.; Gimbert, J .; Miller, M.
Relation: Linear Algebra and Its Applications Vol. 419, Issue 1, p. 234 - 250
Publisher Link: http://dx.doi.org/10.1016/j.laa.2006.04.020
Publisher: Elsevier
Resource Type: journal article
Date: 2006
Description: We derive some Moore-like bounds for multipartite digraphs, which extend those of bipartite digraphs, under the assumption that every vertex of a given partite set is adjacent to the same number δ of vertices in each of the other independent sets. We determine when a multipartite Moore digraph is weakly distance-regular. Within this framework, some necessary conditions for the existence of a r-partite Moore digraph with interpartite outdegree δ > 1 and diameter k = 2m are obtained. In the case δ = 1, which corresponds to almost Moore digraphs, a necessary condition in terms of the permutation cycle structure is derived. Additionally, we present some constructions of dense multipartite digraphs of diameter two that are vertex-transitive.
Subject: multipartite digraphs; Moore digraphs; weakly distance-regular digraphs; degree/diameter problem; eigenvalues
Identifier: http://hdl.handle.net/1959.13/926959
Identifier: uon:9999
Identifier: ISSN:0024-3795
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format